Descriptions
Algorithms and programs. Representations of algorithms, flow-charts. Branching algorithms. Loops. Sub-algorithm. Refining algorithms for given text-based problems. Types. Program structure. Names. Variables. Operations. Expressions. Text output. Boolean expressions, comparing. Functions, description, return of value, invoke. Conditional statement. Loop statement. One-dimensional arrays. Array scan. Array return. Nested loops. String processing. Input and output. Data exchange with files. Screen graphics.
Learning outcomes :
After passing this course the student
- can use fundamental programming constructions: variables, expressions, assignments, conditionals, iterations, procedures, recursion, simple input/output;
- knows basic datatypes and -structures (numeric types, booleans, strings, lists) and can use corresponding standard operations;
- can analyze and explain the behavior of simple programs, and modify and expand them;
- can design algorithms for solving simple problems, and implement, test and debug the corresponding program.
